-
1 Stern-Dreieck-Anlauf
пуск переключением со звезды на треугольник
-EN
star-delta starting
the process of starting a three-phase motor by connecting it to the supply with the primary winding initially connected in star, then reconnected in delta for the running condition
[IEV number 411-52-16]FR
démarrage étoile-triangle
mode de démarrage d'un moteur triphasé à tension réduite, consistant à relier à la source à tension constante les enroulements statoriques, d'abord en couplage étoile, puis à passer au couplage triangle pour le fonctionnement normal
[IEV number 411-52-16]
Magnetic only circuit-breaker - Автоматический выключатель с электромагнитным расцепителем
Y/Δ changeover node - Узел переключения со звезды на треугольник
Contactor KL - Контактор KL
Thermal relay - Тепловое реле
Contactor KΔ - Контактор KΔ
Contactor KY- Контактор KY
Параллельные тексты EN-RU Star-delta Y/Δ starting
Star-delta starting is the best known system and perhaps the commonest starting system at reduced voltage; it is used to start the motor reducing the mechanical stresses and limiting the current values during starting; on the other hand, it makes available a reduced inrush torque.This system can be used for motors with terminal box with 6 terminals and double supply voltage.
It is particularly suitable for no-load starting or with low and constant load torque or lightly increasing load torque, such as in the case of fans or low power centrifugal pumps.
Making reference to the diagram of Figure 6, the starting modality foresees the initial phase with star-connection of the windings to be realized through the closing of the circuit-breaker, of the line contactor KL and of the star contactor KY.
After a suitable predetermined period of time, the opening of the contactor KY and the closing of KΔ allow switching to delta-connection, which is also the configuration of normal running position.
[ABB]Пуск переключением со звезды на треугольник
Пуск переключением со звезды на треугольник является самым известным способом и, возможно, самой распространенной схемой пуска на пониженном напряжении. С одной стороны, этот способ используется для снижения механических нагрузок и ограничения пускового тока, а с другой - обеспечивает уменьшение пускового момента.Такая возможность может быть реализована в двигателях с шестью зажимами в выводной коробке, что позволяет питать его от двух напряжений.
Особенно этот способ подходит для ненагруженного пуска и пуска с низким постоянным или немного увеличивающимся вращающим моментом, например, для пуска вентиляторов или маломощных центробежных насосов.
Схема пуска переключением со звезды на треугольник представлена на рисунке 6. В начальный момент пуска обмотки статора соединяют звездой путем замыкания контактов автоматического выключателя, линейного контактора KL и контактора KY со схемой "звезда".
По истечении заданного времени контакты контактора KY размыкаются и замыкаются контакты контактора КΔ со схемой треугольник.
В результате выполняется переключение обмоток статора со схемы «звезда» на схему «треугольник».
Обе схемы соединения обмоток являются схемами нормального рабочего режима.
[Перевод Интент]Тематики
Обобщающие термины
EN
- star-delta starting
- Y/Δ starting
DE
FR
Немецко-русский словарь нормативно-технической терминологии > Stern-Dreieck-Anlauf
См. также в других словарях:
Heberden's node — Infobox Disease Name = PAGENAME Caption = Heberden s nodes on the 2nd (index) finger of the right hand DiseasesDB = 29319 ICD10 = ICD10|M|15|1|m|15 ICD9 = ICD9|715.04 ICDO = OMIM = 140600 MedlinePlus = eMedicineSubj = eMedicineTopic = MeshID =… … Wikipedia
Dijkstra's algorithm — Not to be confused with Dykstra s projection algorithm. Dijkstra s algorithm Dijkstra s algorithm runtime Class Search algorithm Data structure Graph Worst case performance … Wikipedia
A* search algorithm — In computer science, A* (pronounced A star ) is a best first, graph search algorithm that finds the least cost path from a given initial node to one goal node (out of one or more possible goals). It uses a distance plus cost heuristic function… … Wikipedia
Subgame — In game theory, a subgame is any part (a subset) of a game that meets the following criteria (the following terms allude to a game described in extensive form): [cite web url=http://press.princeton.edu/TOCs/c5590.html title=Table of Contents for… … Wikipedia
Extensive-form game — An extensive form game is a specification of a game in game theory. This form represents the game as a tree. Each node (called a decision node) represents every possible state of play of the game as it is played. Play begins at a unique initial… … Wikipedia
Memory errors — Memory gaps and errors refer to the incorrect recall, or complete loss, of information in the memory system for a specific detail and/or event. Memory errors may include remembering events that never occurred, or remembering them differently from … Wikipedia
Force-based algorithms — Force based or force directed algorithms are a class of algorithms for drawing graphs in an aesthetically pleasing way. Their purpose is to position the nodes of a graph in two dimensional or three dimensional space so that all the edges are of… … Wikipedia
Decision-to-decision path — A decision to decision path, or DD Path, is a path of execution (usually through a graph representing a program, such as a flow chart) that does not include any conditional nodes. That is, it is the path of execution between two decisions. DD… … Wikipedia
Activity diagram — An activity diagram is a diagram that shows activities and actions to describe workflows. [ [http://highered.mcgraw hill.com/sites/0077110005/student view0/glossary.html Glossary of Key Terms] at McGraw hill.com. Retrieved 20 July 2008.] In the… … Wikipedia
Glossary of Unified Modeling Language terms — This glossary of Unified Modeling Language terms covers all versions of UML. Individual entries will point out any distinctions that exist between versions.A* Abstract An indicator applied to a classifier (e.g., actor, class, use case) or to some … Wikipedia
extensive form game — noun Informally, a representation of a game as a tree of decision nodes, with the game beginning at a unique initial node, and flowing through the tree along a path determined by the players until a terminal node is reached, where play ends and… … Wiktionary
